Parallel algorithms for the maximal independent set problem in graphs
نویسنده
چکیده
In this paper we describe the randomized parallel algorithm proposed by Blelloch et al. [BFS12] to compute a Maximal Independent Set (MIS) of a given graph. We implemented their algorithm as well as the fastest sequential algorithm and compared their performance with different input graphs. Furthermore, we compared the number of rounds in both the sequential and parallel algorithms and present empirical evidence of the intrinsic parallelism in the algorithm proposed by Blelloch et al. [BFS12].
منابع مشابه
Global Forcing Number for Maximal Matchings under Graph Operations
Let $S= \{e_1,\,e_2, \ldots,\,e_m\}$ be an ordered subset of edges of a connected graph $G$. The edge $S$-representation of an edge set $M\subseteq E(G)$ with respect to $S$ is the vector $r_e(M|S) = (d_1,\,d_2,\ldots,\,d_m)$, where $d_i=1$ if $e_i\in M$ and $d_i=0$ otherwise, for each $i\in\{1,\ldots , k\}$. We say $S$ is a global forcing set for maximal matchings of $G$ if $...
متن کاملSome Results on the Maximal 2-Rainbow Domination Number in Graphs
A 2-rainbow dominating function ( ) of a graph is a function from the vertex set to the set of all subsets of the set such that for any vertex with the condition is fulfilled, where is the open neighborhood of . A maximal 2-rainbow dominating function on a graph is a 2-rainbow dominating function such that the set is not a dominating set of . The weight of a maximal is the value . ...
متن کاملProbabilistic Analysis of a Parallel Algorithm for Finding Maximal Independent Sets
We consider a natural parallel version of the classical greedy algorithm for finding a maximal independent set in a graph. This version was studied in Coppersmith, Rhagavan and Tompa [CRT] and they conjecture there that its expected running time on random graphs of arbitrary edge density is O(logn). We prove that conjecture.
متن کاملOn Parallel Algorithms for Combinatorial Problems
Graphs are the most widely used of all mathematical structures. There is uncountable number of interesting computational problems de ned in terms of graphs. A graph can be seen as a collection of vertices (V ), and a collection of edges (E) joining all or some of the vertices. One is very often interested in nding subsets, either from the set V of vertices or from the set E of edges, which poss...
متن کاملLITERATURE REVIEW: Parallel algorithms for the maximal independent set problem in graphs
Let G = (V,E) be an undirected graph. An independent set of G is a subset I of V such that no two vertex in I are adjacent in G. A Maximal Independent Set (MIS) of G is an independent set such that adding any other vertex to it forces the set to contain an edge between two of its vertices. A Maximum independent Set (MaxIS) is a largest maximal independent set contained in V ; see Fig. 1. The pr...
متن کامل